Sublogarithmic approximation for telephone multicast
نویسندگان
چکیده
منابع مشابه
Sublogarithmic approximation for telephone multicast: path out of jungle
Consider a network of processors modeled by an n-vertex graph G = (V,E). Assume that the communication in the network is synchronous, i.e., occurs in discrete “rounds”, and in every round every processor is allowed to pick one of its neighbors, and to send it a message. The telephone k-multicast problem requires to compute a schedule with minimal number of rounds that delivers a message from a ...
متن کاملA Sublogarithmic Approximation for Highway and Tollbooth Pricing
An instance of the tollbooth problem consists of an undirected network and a collection of singleminded customers, each of which is interested in purchasing a fixed path subject to an individual budget constraint. The objective is to assign a per-unit price to each edge in a way that maximizes the collective revenue obtained from all customers. The revenue generated by any customer is equal to ...
متن کاملSublogarithmic Ambiguity
So far the least growth rate known for a divergent inherent ambiguity function was logarithmic. This paper shows that for each computable divergent total non-decreasing function f : N → N there is a context-free language L with a divergent inherent ambiguity function g below f . This proves that extremely slow growing divergent inherent ambiguity functions exist. For instance there is a context...
متن کاملSublogarithmic Searching without Multiplications
We show that a unit-cost RAM with word length w can maintain an ordered set of w-bit integers (or binary strings) under the operations search, insert, delete, nearest neighbour in O(p log n) worst-case time and range queries in O(p log n+size of output) worst-case time. The operations rely on AC 0 instructions only, thereby solving an open problem posed by Fredman and Willard. The data structur...
متن کاملtight frame approximation for multi-frames and super-frames
در این پایان نامه یک مولد برای چند قاب یا ابر قاب تولید شده تحت عمل نمایش یکانی تصویر برای گروه های شمارش پذیر گسسته بررسی خواهد شد. مثال هایی از این قاب ها چند قاب های گابور، ابرقاب های گابور و قاب هایی برای زیرفضاهای انتقال پایاست. نشان می دهیم که مولد چند قاب تنک نرمال شده (ابرقاب) یکتا وجود دارد به طوری که مینیمم فاصله را از ان دارد. همچنین مسایل مشابه برای قاب های دوگان مطرح شده و برخی ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2006
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2005.12.002